Rank parity for congruent supersingular elliptic curves
نویسندگان
چکیده
منابع مشابه
Constructing Supersingular Elliptic Curves
We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over Fq with trace of Frobenius t in case such a curve exists. If GRH holds true, the expected run time of our algorithm is e O((log q)). We illustrate the algorithm by showing how to construct supersingular curves of prime order. Such curves can readily be used for pairing based c...
متن کاملOn the rank of certain parametrized elliptic curves
In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.
متن کاملMinimal Cm Liftings of Supersingular Elliptic Curves
In this paper, we give a ‘direct’ construction of the endomorphism ring of supersingular elliptic curves over a prime field Fp from ‘ideal classes’ of Q( √−p). We use the result to prove that the result of Kaneko on ‘minimal’ CM liftings of such supersingular elliptic curves is a best possible result. We also prove that the result of Elkies on ‘minimal’ CM liftings of all supersingular elliptic...
متن کاملCM liftings of supersingular elliptic curves
Assuming GRH, we present an algorithm which inputs a prime p and outputs the set of fundamental discriminants D < 0 such that the reduction map modulo a prime above p from elliptic curves with CM by OD to supersingular elliptic curves in characteristic p. In the algorithm we first determine an explicit constant Dp so that |D| > Dp implies that the map is necessarily surjective and then we compu...
متن کاملMicrosoft Word - Finding More Non-supersingular Elliptic Curves for Pairing..
In this paper, a model of self-organizing spiking neural networks is introduced and applied to mobile robot environment representation and path planning problem. A network of spike-response-model neurons with a recurrent architecture is used to create robot’s internal representation from surrounding environment. The overall activity of network simulates a self-organizing system with unsupervise...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2017
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/13545